ALGORITHMIC PROOF OF MaxMult(T) = p(T)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algorithmic proof of Brégman-Minc theorem

This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to da...

متن کامل

Some Algorithmic and Proof - TheoreticalAspects of Coercive

Coercive subtyping ooers a conceptually simple but powerful framework to understand subtyping and subset relationships in type theory. In this paper we study some of its proof-theoretic and computational properties.

متن کامل

Algorithmic proof of the epsilon constant conjecture

In this paper we will algorithmically prove the global epsilon constant conjecture for all Galois extensions L/Q of degree at most 15. In fact, we will obtain a slightly more general result whose proof is based on an algorithmic proof of the local epsilon constant conjecture for Galois extensions E/Qp of small degree. To this end we will present an efficient algorithm for the computation of loc...

متن کامل

Algorithmic Proof with Diminishing Resources, Part 1

This paper examines the following theme. A~ume we are given a consequence relation lof the form A1,. . . , An tB and an algorithmic proof system Stfor deciding (either in a recursive of RE manner) whether for given A1,.. . ,An,B the relation A1,. . . ,A, JB holds. Is it possible to perturb S~ into a proof system LS~ which is still complete for t-, and such that each A~ is used in the proof at m...

متن کامل

Algorithmic Tamper-Proof Security under Probing Attacks

Gennaro et al. initiated the study of algorithmic tamper proof (ATP) cryptography: cryptographic hardware that remains secure even in the presence of an adversary who can tamper with the memory content of a hardware device. In this paper, we solve an open problem stated in their paper, and also consider whether a device can be secured against an adversary who can both tamper with its memory and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications of the Korean Mathematical Society

سال: 2012

ISSN: 1225-1763

DOI: 10.4134/ckms.2012.27.4.665